The spanning laceability on the faulty bipartite hypercube-like networks
نویسندگان
چکیده
a Institute of Information Science, Academia Sinica, Taipei City 11529, Taiwan, ROC Department of Computer Science and Information Engineering, Hungkuang University, Taichung City 433, Taiwan, ROC Department of Computer Science, National Chiao Tung University, Hsinchu 30010, Taiwan, ROC Department of Computer Science and Information Engineering, Providence University, Taichung City 433, Taiwan, ROC e IMFM, University of Ljubljana, 1111 Ljubljana, Slovenia
منابع مشابه
On the spanning connectivity and spanning laceability of hypercube-like networks
Let u and v be any two distinct nodes of an undirected graph G, which is k-connected. For 1 ≤ w ≤ k, a w-container C(u, v) of a k-connected graph G is a set of w-disjoint paths joining u and v. A w-container C(u, v) of G is a w-container if it contains all the nodes of G. A graph G is w-connected if there exists a w-container between any two distinct nodes. A bipartite graph G is w-laceable if ...
متن کاملPaired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
A paired many-to-many k-disjoint path cover (paired k-DPC for short) of a graph is a set of k vertex-disjoint paths joining k distinct source-sink pairs that altogether cover every vertex of the graph. We consider the problem of constructing paired 2-DPC’s in an m-dimensional bipartite HL-graph, Xm, and its application in finding the longest possible paths. It is proved that every Xm, m ≥ 4, ha...
متن کاملHamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
In this paper, we analyze a hypercube-like structure, called the folded hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd.We also show that the n-dimensional folded hypercube is strongly Hamiltonian-laceable when n is odd, and is Hamiltonian-connected when n = 1...
متن کاملThe longest ring embedding in faulty hypercube
In this paper, we show that the adjacency fault tolerance for property 2H of hypercube. We also show that the adjacency fault tolerance for Hamiltonian laceability of hypercube. Applying these results, we can construct the fault-free cycle with length 2 − 2 | Fv | +4 in Qn − Fv where Fv is the faulty vertices set with at least two black vertices and two white vertices with | Fv |≤ n− 1.
متن کاملThe Spanning Laceability of k-ary n-cubes when k is Even
Qn has been shown as an alternative to the hypercube family. For any even integer k ≥ 4 and any integer n ≥ 2, Qn is a bipartite graph. In this paper, we will prove that given any pair of vertices, w and b, from different partite sets of Qn, there exist 2n internally disjoint paths between w and b, denoted by {Pi | 0 ≤ i ≤ 2n− 1}, such that ⋃2n−1 i=0 Pi covers all vertices of Qn. The result is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 219 شماره
صفحات -
تاریخ انتشار 2013